On Systems of Linear Diophantine Equations
نویسنده
چکیده
Introduction Something happened to me recently I would wager has happened to many who read this note. Teaching a new topic, you cannot understand one of the proofs. Your first attempt to fill the gap fails. You look through your books for an answer. Next, you ask colleagues, go to the library, maybe even use the interlibrary loan. All in vain. Then it strikes you that, in fact, you cannot answer an even more basic and seemingly more interesting question. You peruse the books again. They seem to have answers to thousands of strange questions, but not to yours (the most natural one!). At the same time you cannot believe that your question could have been overlooked by generations of mathematicians. Days pass; the agony continues.
منابع مشابه
Diophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملOn Solving Linear Diophantine Systems Using Generalized Rosser’s Algorithm
A difficulty in solving linear Diophantine systems is the rapid growth of intermediate results. Rosser’s algorithm for solving a single linear Diophatine equation is an efficient algorithm that effectively controls the growth of intermediate results. Here, we propose an approach to generalize Rosser’s algorithm and present two algorithms for solving systems of linear Diophantine equations. Then...
متن کاملComplete Solving of Linear
In this paper, we present an algorithm for solving directly linear Diophantine systems of both equations and inequations. Here directly means without adding slack variables for encoding inequalities as equalities. This algorithm is an extension of the algorithm due to Con-tejean and Devie 9] for solving linear Diophantine systems of equations, which is itself a generalization of the algorithm o...
متن کاملMultivariate Discrete Splines and Linear Diophantine Equations
In this paper we investigate the algebraic properties of multivariate discrete splines. It turns out that multivariate discrete splines are closely related to linear diophantine equations. In particular, we use a solvability condition for a system of linear diophantine equations to obtain a necessary and sufficient condition for the integer translates of a discrete box spline to be linearly ind...
متن کاملSolving Linear Diophantine Constraints Incrementally
In this paper, we show how to handle linear Diophantine constraints incre-mentally by using several variations of the algorithm by Contejean and Devie (hereafter called ABCD) for solving linear Diophantine systems 4, 5]. The basic algorithm is based on a certain enumeration of the potential solutions of a system, and termination is ensured by an adequate restriction on the search. This algorith...
متن کامل